Type inference for polymorphic references
نویسندگان
چکیده
منابع مشابه
Polymorphic type inference for the relational algebra
We give a polymorphic account of the relational algebra. We introduce a formalism of \type formulas" speci cally tuned for relational algebra expressions, and present an algorithm that computes the \principal" type for a given expression. The principal type of an expression is a formula that speci es, in a clear and concise manner, all assignments of types (sets of attributes) to relation names...
متن کاملPolymorphic Type Inference for the JNI
We present a multi-lingual type inference system for checking type safety of programs that use theJava Native Interface (JNI). The JNI uses specially-formatted strings to represent class and field namesas well as method signatures, and so our type system tracks the flow of string constants through theprogram. Our system embeds string variables in types, and as those variables are re...
متن کاملPolymorphic Constraint-Based Type Inference for Objects
Constraint-based type inference infers types with subtyping constraints. Such types can capture detailed data and control flow information about the analyzed program. In the presence of polymorphism, existing constraint-based type inference algorithms sacrifice much precision for efficiency. This paper presents both theoretical and practical results on developing precise and efficient polymorph...
متن کاملPolymorphic Type Inference in Scheme
This paper presents a type-inference system for Scheme that is designed to be used by students in an introductory programming course. The major goal of the work is to present a simple type inference system that can be used by beginning students, yet is powerful enough to express the ideas of types, polymorphism, abstract data types (ADTs), and higher-order procedures. The system also performs s...
متن کاملPolymorphic Type Inference and Semi-Uni cation
In the last ten years declaration-free programming languages with a polymorphic typing discipline (ML, B) have been developed to approximate the exibility and conciseness of dynamically typed languages (LISP, SETL) while retaining the safety and execution e ciency of conventional statically typed languages (Algol68, Pascal). These polymorphic languages can be type checked at compile time, yet a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 1990
ISSN: 0890-5401
DOI: 10.1016/0890-5401(90)90018-d